Approximation Algorithms for Multitasking Scheduling Problems
نویسندگان
چکیده
منابع مشابه
Approximation algorithms for stochastic scheduling problems
In this dissertation we study a broad class of stochastic scheduling problems characterized by the presence of hard deadline constraints. The input to such a problem is a set of jobs, each with an associated value, processing time, and deadline. We would like to schedule these jobs on a set of machines over time. In our stochastic setting, the processing time of each job is random, known in adv...
متن کاملApproximation algorithms for scheduling and two-dimensional packing problems
This dissertation thesis is concerned with two topics of combinatorial optimization: scheduling and geometrical packing problems. Scheduling deals with the assignment of jobs to machines in a ‘good’ way, for suitable notions of good. Two particular problems are studied in depth: on the one hand, we consider the impact of machine failure on online scheduling, i.e. what are the consequences of th...
متن کاملApproximation algorithms for problems in scheduling with set-ups
In this paper, we present new approximation results for the offline problem of single machine scheduling with sequenceindependent set-ups and item availability, where the jobs to be scheduled are independent (i.e., have no precedence constraints) and have a common release time. We present polynomial-time approximation algorithms for two versions of this problem. In the first version, the input ...
متن کاملApproximation Algorithms for 2-Stage Stochastic Scheduling Problems
There has been a series of results deriving approximation algorithms for 2-stage discrete stochastic optimization problems, in which the probabilistic component of the input is given by means of "black box", from which the algorithm "learns" the distribution by drawing (a polynomial number of) independent samples. The performance guarantees proved for such problems, of course, is generally wors...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3007755